Maximum Load and Minimum Volume Structural Optimization
نویسنده
چکیده مقاله:
A bi-criteria optimization is considered whose objectives are the maximization of the load sustained by a structure and the minimization of the structure's volume. As the objectives are conflicting, the solution to the problem is of the Pareto type. The problem is elaborated for a thin-walled column of cruciform cross-section, prone to flexural and torsional buckling. A numerical example is also presented.
منابع مشابه
Lexicographically Minimum and Maximum Load Linear Programming Problems
In this paper we introduce the lexicographically minimum load linear programming problem and we provide a polynomial approach followed by the proof of correctness. This problem has applications in numerous areas where it is desirable to achieve an equitable distribution or sharing of resources. We consider the application of our technique in the problem of lexicographically minimum load in capa...
متن کاملGrading of Glioma Tumors by Analysis of Minimum Apparent Diffusion Coefficient and Maximum Relative Cerebral Blood Volume
Background: Gliomas are the most common primary neoplasms of the central nervous system. Relative cerebral blood volume (rCBV) could estimate high-grade Gliomas computed with dynamic susceptibility contrast MR imaging which it is artificially lowered by contrast extravasation through a disrupted blood-brain barrier. Objectives: Our intent was to clarify the usefulness of diffusion-weighted m...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملMaximum Clique and Minimum
In an alternative approach to \characterizing" the graph class of visibility graphs of simple polygons, we study the problem of nding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maximum clique problem on general graphs implies that no ...
متن کاملoptimal design of three phase surface mounted permanent magnet synchronous motor by particle swarm optimization and bees algorithm for minimum volume and maximum torque
in this paper, the optimal design of a three phase surface mounted permanent magnet synchronous motor has been done by particle swarm optimization and bees algorithm. this machine has been designed for high speed applications, and an epoxy and glass fiber bandage is used for permanent magnet protection against centrifugal forces. the optimization has been done by new design equations to improve...
متن کاملMaximum Flows and Minimum Cuts
In the mid-1950s, U. S. Air Force researcher Theodore E. Harris and retired U. S. Army general Frank S. Ross published a classified report studying the rail network that linked the Soviet Union to its satellite countries in Eastern Europe. The network was modeled as a graph with 44 vertices, representing geographic regions, and 105 edges, representing links between those regions in the rail net...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 13 شماره 3
صفحات 11- 20
تاریخ انتشار 2000-08-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023